Method and apparatus for determining control channel search space

ABSTRACT

Embodiments of the present disclosure provide a method for detecting downlink control information. The method includes: determine a parameter A (c) , according to an index number c of a physical resource set; determine a search space associated with the physical resource set, according to the parameter A (c) , wherein the parameter A (c) =39827 if the index number c is a first index number, the parameter A (c) =39829 if the index number c is a second index number; detecting in the search space, downlink control information from a base station.

CROSS REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No.15/624,664, filed on Jun. 15, 2017, which is a continuation of U.S.patent application Ser. No. 14/699,679, filed on Apr. 29, 2015, now U.S.Pat. No. 9,699,783. which is a continuation of International ApplicationNo. PCT/CN2012/083938, filed on Nov. 1, 2012. All of the afore-mentionedpatent applications are hereby incorporated by reference in theirentireties.

TECHNICAL FIELD

Embodiments of the present disclosure relate to the communicationsfield, and specifically, to a method and an apparatus for determining acontrol channel search space.

BACKGROUND

An orthogonal frequency division multiplexing technology (OFDM) is asystem key multiple access technology of beyond third generation(B3G)/the fourth generation (4G) mobile communications systems, and isalso a downlink multiple access technology used by Long Term Evolution(LTE)/LTE Advanced (LTE-A) systems.

In terms of time, a length of an OFDM radio frame is 10 ms, including 10subframes. A length of each subframe is 1 ms, each subframe includes twotimeslots, and each timeslot includes seven or six OFDM symbols. Interms of frequency, one OFDM radio frame includes multiple subcarriers.A subcarrier in an OFDM symbol is referred to as a resource element(RE), four REs form a resource element group (REG), nine REGs form acontrol channel element (CCE), and 12 subcarriers and one timeslot forma resource block (RB). RBs are classified into physical resource blocks(PRB) and virtual resource blocks (VRB); a PRB refers to an actualfrequency location of an RB, and PRBs are numbered in ascending order;two PRBs form a PRB pair; a numbering form different from that for PRBsis used for VRBs, to map VRBs to PRBs by using a specific resourceallocation manner. Various control information, reference signals orservice data is transmitted on these time frequency resources.

A physical downlink control channel (PDCCH) is a channel that is definedin LTE Release-8/Release-9/Release-10. The PDCCH bears downlink controlinformation (DCI). The DCI includes scheduling information, powercontrol information, and the like, of a downlink data channel or anuplink data channel. In the prior art, an evolved Node B (eNB) maydetermine a search space of the PDCCH according to an aggregation level,and an user equipment (UE) obtains, by searching, an effective PDCCH inthe determined search space. The PDCCH has four aggregation levels,which are 1, 2, 4, and 8 respectively, and indicates respectively thatthe PDCCH is mapped to one, two, four, and eight CCEs. One aggregationlevel corresponds to a search space size and the number of PDCCHcandidates, that is, a possible PDCCH location that one PDCCH may bemapped to.

An enhanced physical downlink control channel (EPDCCH) is furtherintroduced to LTE Release-11. The EPDCCH occupies physical resources ofa data channel, and is multiplexed with the data channel in a frequencydivision multiplexing manner. The number of resources that are occupiedby an EPDCCH is notified to a UE by higher layer or physical layersignaling. The eNB allocates one or more groups of time frequencyresources for EPDCCHs in a search space, where one group of physicalresources is referred to as an EPDCCH set. An aggregation level of anEPDCCH determines the number of enhanced control channel elements (eCCE)that are occupied by the EPDCCH. Transmission solutions of EPDCCHs maybe classified into localized transmission and distributed transmissionaccording to whether resources used by the EPDCCHs are continuous in thefrequency domain. The search space determining manner in the prior artcauses that multiple EPDCCH sets or UEs use a same search space, whichleads to, when the number of users increases, a serious control channelcongestion phenomenon and an obvious search space conflict phenomenon.

SUMMARY

For the foregoing problem, embodiments of the present disclosure providea method and an apparatus for determining a control channel searchspace, which can reduce a conflict probability of control channel searchspaces.

According to a first aspect, a specific implementation is: a method fordetermining a control channel search space is proposed, including:determining numbers of at least two EPDCCH sets used for enhancedphysical downlink control channel EPDCCH transmission; determining,according to the numbers of the EPDCCH sets, location offsets of searchspaces corresponding to the EPDCCH sets; and determining, according tothe location offsets of the search spaces corresponding to the EPDCCHsets, the search spaces corresponding to the EPDCCH sets.

In a first possible implementation manner, with reference to the firstaspect: the determining numbers of at least two EPDCCH sets used forenhanced physical downlink control channel EPDCCH transmission includes:determining a first number of a first EPDCCH set used for EPDCCHtransmission and a second number of a second EPDCCH set used for EPDCCHtransmission.

In a second possible implementation manner, with reference to the firstaspect or the first possible implementation manner of the first aspect,a specific implementation is: the determining, according to the numberof the EPDCCH sets, location offsets of search spaces corresponding tothe EPDCCH sets includes: determining, according to the first number, afirst location offset of a search space corresponding to the firstEPDCCH set, or determining, according to the second number, a secondlocation offset of a search space corresponding to the second EPDCCHset.

In a third possible implementation manner, with reference to the firstaspect or the first possible implementation manner of the first aspector the second possible implementation manner of the first aspect, aspecific implementation is: the determining, according to the locationoffsets of the search spaces corresponding to the EPDCCH sets, thesearch spaces corresponding to the EPDCCH sets includes: determining,according to the first location offset, the search space correspondingto the first EPDCCH set; or determining, according to the secondlocation offset, the search space corresponding to the second EPDCCHset; or determining, according to the first location offset, the searchspace corresponding to the second EPDCCH set.

According to a second aspect, a method for determining a control channelsearch space is provided, including: determining a first number of afirst EPDCCH set or a second number of a second EPDCCH set, where thefirst EPDCCH set and the second EPDCCH set are used for EPDCCHtransmission; determining, according to the first number, a firstlocation offset of a search space corresponding to the first EPDCCH set;determining a first offset parameter; and determining a second locationoffset according to the first offset parameter and the first locationoffset; determining, according to the first location offset, the searchspace corresponding to the first EPDCCH set; and determining, accordingto the second location offset, a search space corresponding to thesecond EPDCCH set.

In a first possible implementation manner, with reference to the secondaspect, the method further includes: the determining a first offsetparameter includes: determining that the first offset parameter is aninteger that is greater than 0 and less than 65538, or determining thefirst offset parameter according to a cell identity, or determining thefirst offset parameter according to a UE identifier.

In a second possible implementation manner, with reference to the secondaspect or the first possible implementation manner of the second aspect,a specific implementation is: the first offset parameter is 39827.

In a third possible implementation manner, with reference to the secondaspect or the first possible implementation manner of the second aspect,a specific implementation is: the determining the first offset parameteraccording to a cell identity includes: determining the first offsetparameter according to the cell identity and the number of virtualresources in the second EPDCCH set, or according to the cell identityand the number of physical resources in the second EPDCCH set, oraccording to the cell identity and the number of virtual resourcescorresponding to a unit physical resource, or according to the cellidentity and an EPDCCH transmission mode, or according to the cellidentity and an EPDCCH aggregation level.

In a fourth possible implementation manner, with reference to the secondaspect or the first possible implementation manner of the second aspect,a specific implementation is: the determining the first offset parameteraccording to a UE identifier includes: determining the first offsetparameter according to the UE identifier and the number of virtualresources in the second EPDCCH set, or according to the UE identifierand the number of physical resources in the second EPDCCH set, oraccording to the UE identifier and the number of virtual resourcescorresponding to a unit physical resource, or according to the UEidentifier and an EPDCCH transmission mode, or according to the UEidentifier and an EPDCCH aggregation level.

In a fifth possible implementation manner, with reference to the secondaspect, a specific implementation is: the determining the firstparameter further includes: determining the first offset parameteraccording to the number of virtual resources in the second EPDCCH set,or according to the number of physical resources in the second EPDCCHset, or according to the number of virtual resources corresponding to aunit physical resource, or according to an EPDCCH transmission mode, oraccording to a cell identity and an EPDCCH aggregation level.

According to a third aspect, a method for determining a control channelsearch space is proposed, including: determining a first number of afirst EPDCCH set or a second number of a second EPDCCH set, where thefirst EPDCCH set and the second EPDCCH set are used for EPDCCHtransmission; determining, according to the first number, a firstlocation offset of a search space corresponding to the first EPDCCH set;determining a first offset parameter; determining the search space ofthe first EPDCCH set according to the first location offset, anddetermining, according to the first location offset and the first offsetparameter, a search space corresponding to a search space of the secondEPDCCH set.

In a first possible implementation manner, with reference to the thirdaspect, the method further includes: for details about the determining afirst offset parameter, refer to the method for determining a firstoffset parameter in the second aspect.

According to a fourth aspect, a method for determining a control channelsearch space is proposed, including: determining a first number of afirst EPDCCH set or a second number of a second EPDCCH set, where thefirst EPDCCH set and the second EPDCCH set are used for EPDCCHtransmission; determining a first parameter or a second parameteraccording to a number of the EPDCCH set; determining, according to thefirst parameter or the second parameter, a location offset of a searchspace corresponding to the EPDCCH set; and determining, according to thelocation offset of the search space corresponding to the EPDCCH set, thesearch space corresponding to the EPDCCH set.

In a first possible implementation manner, with reference to the fourthmanner, the method further includes: the determining a first parameteror a second parameter includes: determining the first parameteraccording to a cell identity or a UE identifier; or determining thesecond parameter according to a cell identity or a UE identifier.

According to a fifth aspect, a method for determining a control channelsearch space is provided, including: determining a first number of afirst EPDCCH set or a second number of a second EPDCCH set, where thefirst EPDCCH set and the second EPDCCH set are used for EPDCCHtransmission; determining a second offset parameter according to anumber of the EPDCCH set; determining, according to the second offsetparameter, a location offset of a search space corresponding to theEPDCCH set; and determining, according to the location offset of thesearch space corresponding to the EPDCCH set, the search spacecorresponding to the EPDCCH set.

In a first possible implementation manner, with reference to the fifthmanner, the method further includes: the determining a second offsetparameter includes: determining the second offset parameter according toa cell identity or a UE identifier.

According to a sixth aspect, a method for determining a control channelsearch space is proposed, including: determining a location offset of asearch space corresponding to an EPDCCH set according to information indownlink control information, or a physical random access channelpreamble identifier, or information in random access response grant, orinformation in a message 3 that is used for random access.

According to a seventh aspect, an apparatus for determining a controlchannel search space is proposed, including: a number determining unit,configured to determine numbers of at least two EPDCCH sets used forenhanced physical downlink control channel EPDCCH transmission; anoffset determining unit, configured to determine, according to thenumbers of the EPDCCH sets, location offsets of search spacescorresponding to the EPDCCH sets; and a search space determining unit,configured to determine, according to the location offsets of the searchspaces corresponding to the EPDCCH sets, the search spaces correspondingto the EPDCCH sets.

In a first possible implementation manner, with reference to the seventhaspect, the apparatus further includes: the number determining unit isspecifically configured to: determine a first number of a first EPDCCHset used for EPDCCH transmission and a second number of a second EPDCCHset used for EPDCCH transmission.

In a second possible implementation manner, with reference to theseventh aspect or the first possible implementation manner of theseventh aspect, a specific implementation is: the offset determiningunit includes: a first offset determining subunit, configured todetermine, according to the first number, a first location offset of asearch space corresponding to the first EPDCCH set; and/or a secondoffset determining subunit, configured to determine, according to thesecond number, a second location offset of a search space correspondingto the second EPDCCH set; and/or a first offset parameter determiningunit, configured to determine a first offset parameter; and/or a secondoffset parameter determining unit, configured to determine a firstparameter or a second parameter or a second offset parameter.

In a third possible implementation manner, with reference to the seventhaspect or the first possible implementation manner of the seventh aspector the second possible implementation manner of the seventh aspect, aspecific implementation is: the search space determining unit isspecifically configured to: determine, according to the first locationoffset, the search space corresponding to the first EPDCCH set; ordetermine, according to the second location offset, the search spacecorresponding to the second EPDCCH set; or determine, according to thefirst location offset, the search space corresponding to the secondEPDCCH set.

In a fourth possible implementation manner, with reference to theseventh aspect, a specific implementation is: the offset determiningunit is specifically configured to: determine a first offset location;determine a first offset parameter; and determine a second locationoffset according to the first offset parameter and the first locationoffset.

In a fifth possible implementation manner, with reference to the seventhaspect or the second possible implementation manner of the seventhaspect, a specific implementation is: the first offset parameterdetermining unit is specifically configured to: determine the firstoffset parameter from integers within a range greater than 0 and lessthan 65538; or determine the first offset parameter according to a cellidentity; or determine the first offset parameter according to a UEidentifier.

In a sixth possible implementation manner, with reference to the seventhaspect or the second possible implementation manner of the seventhaspect, a specific implementation is: the offset determining unitincludes: a second offset parameter determining unit, configured todetermine a first parameter A^((c)) or a second parameter D^((c)) or asecond offset parameter r^((c)) according to the number of the EPDCCHset.

In a seventh possible implementation manner, with reference to theseventh aspect or the sixth possible implementation manner of theseventh aspect, a specific implementation is: the offset determiningunit is specifically configured to: determine, according to the firstparameter A^((c)) or the second parameter D^((c)), the location offsetof the search space corresponding to the EPDCCH set; or determine,according to the second offset parameter r^((c)), the location offset ofthe search space corresponding to the EPDCCH set.

In an eighth possible implementation manner, with reference to theseventh aspect or the third possible implementation manner of theseventh aspect, a specific implementation is: the search spacedetermining unit further includes: a first offset parameter determiningunit, configured to determine the first offset parameter; and a searchspace determining subunit, configured to determine, according to thefirst location offset and the first offset parameter, the search spacecorresponding to the second EPDCCH set.

In a ninth possible implementation manner, with reference to the seventhaspect or the second possible implementation manner of the seventhaspect, a specific implementation is: the offset determining unit isspecifically configured to: determine the location offsets of the searchspaces corresponding to the EPDCCH sets according to information indownlink control information, or a physical random access channelpreamble identifier, or information in random access response grant, orinformation in a message 3 used for random access.

According to an eighth aspect, an apparatus for determining a controlchannel search space is proposed, including: a memory, configured tostore numbers of EPDCCH sets used for enhanced physical downlink controlchannel EPDCCH transmission; determine, according to the numbers of theEPDCCH sets, location offsets of search spaces corresponding to theEPDCCH sets; and determine, according to the location offsets of thesearch spaces corresponding to the EPDCCH sets, code that is required bythe search spaces corresponding to the EPDCCH sets; and a processor,configured to execute the code in the memory.

Based on the foregoing technical solutions, by grouping and numberingtime frequency resources of EPDCCHs, and determining different locationoffsets for different EPDCCH search spaces according to the numbers, themethod and the apparatus for determining a control channel search spaceprovided by the embodiments herein can reduce a probability of controlchannel search spaces conflict.

According to yet another aspect, there is provided a method fordetermining a control channel search space at a communication devicewhen at least two physical resource sets are configured for downlinkcontrol channel transmission. The method includes determining numbers ofthe at least two physical resource sets, and determining, according tothe numbers of the at least two physical resource sets, location offsetsof search spaces corresponding to the at least two physical resourcesets, wherein the determined location offsets of the search spacescomprises at least two different location offsets of the search spaces.The method also includes determining, according to the location offsetsof the search spaces corresponding to the at least two physical sets,the search spaces corresponding to the at least two physical resourcesets.

According to yet another aspect, there is provided a device including amemory and a processor, wherein the processor is configured to determinenumbers of the at least two physical resource sets, determine, accordingto the numbers of the at least two physical resource sets, locationoffsets of search spaces corresponding to the at least two physicalresource sets, wherein the determined location offsets of the searchspaces comprises at least two different location offsets of the searchspaces, and determine, according to the location offsets of the searchspaces corresponding to the at least two physical sets, the searchspaces corresponding to the at least two physical resource sets.

BRIEF DESCRIPTION OF THE DRAWINGS

To describe the technical solutions in the embodiments of the presentdisclosure more clearly, the following briefly introduces theaccompanying drawings required for describing the embodiments of thepresent disclosure. Apparently, the accompanying drawings in thefollowing description show merely some embodiments of the presentdisclosure, and a person of ordinary skill in the art may still deriveother drawings from these accompanying drawings without creativeefforts.

FIG. 1 is a schematic flowchart of a method for determining a searchspace according to an embodiment of the present disclosure;

FIG. 2 is a schematic flowchart of a method for determining a searchspace according to another embodiment of the present disclosure;

FIG. 3 is a schematic flowchart of a method for determining a searchspace according to another embodiment of the present disclosure;

FIG. 4 is a schematic flowchart of a method for determining a searchspace according to another embodiment of the present disclosure;

FIG. 5 is a schematic flowchart of a method for determining a searchspace according to another embodiment of the present disclosure;

FIG. 6 is a schematic flowchart of a method for determining a searchspace according to another embodiment of the present disclosure;

FIG. 7 is a schematic block diagram of an apparatus for determining asearch space according to an embodiment of the present disclosure;

FIG. 8 is a schematic block diagram of an apparatus for determining asearch space according to another embodiment of the present disclosure;

FIG. 9 is a schematic block diagram of an apparatus for determining asearch space according to another embodiment of the present disclosure;

FIG. 10 is a schematic block diagram of an apparatus for determining asearch space according to another embodiment of the present disclosure;and

FIG. 11 is a schematic block diagram of an apparatus for determining asearch space according to another embodiment of the present disclosure.

DETAILED DESCRIPTION

To make the objectives, technical solutions, and advantages of theembodiments of the present disclosure clearer, the following clearlydescribes the technical solutions in the embodiments of the presentdisclosure with reference to the accompanying drawings in theembodiments of the present disclosure. Apparently, the describedembodiments are a part rather than all of the embodiments of the presentdisclosure. All other embodiments obtained by a person of ordinary skillin the art based on the embodiments of the present disclosure withoutcreative efforts shall fall within the protection scope of the presentdisclosure.

It should be understood that, the technical solutions of the embodimentsof the present disclosure may be applied to various communicationssystems, such as: a Global System for Mobile Communications (GSM)system, a Code Division Multiple Access (CDMA) system, a Wideband CodeDivision Multiple Access (WCDMA) system, a general packet radio service(GPRS) system, a Long Term Evolution (LTE) system, an LTE frequencydivision duplex (FDD) system, an LTE time division duplex (TDD) system,and a Universal Mobile Telecommunications System (UMTS).

It should also be understood that in the embodiments of the presentdisclosure, a user equipment (UE) may be referred to as a terminal, amobile station (MS), a mobile terminal, and the like. The user equipmentmay communicate with one or more core networks through a radio accessnetwork (RAN). For example, the user equipment may be a mobile phone(also referred to as a “cellular” phone) or a computer with a mobileterminal. For example, the user equipment may also be a portable,pocket-sized, handheld, computer built-in, or in-vehicle mobileapparatus, which exchanges voice and/or data with the radio accessnetwork.

In the embodiments of the present disclosure, a base station may be abase station (BTS) in GSM or CDMA, may also be a base station (NB) inWCDMA, and may further be an evolved NodeB (eNB or e-NodeB) in LTE,which is not limited in the present disclosure. However, for convenientdescription, a base station (eNB) and a user equipment (UE) are used asexamples to illustrate the following embodiments.

It should also be understood that in the embodiments of the presentdisclosure, a control channel may include other physical layer controlchannels, such as a PDCCH and an EPDCCH, but for ease of description,only an EPDCCH is used as an example to illustrate the embodiments ofthe present disclosure, and the embodiments of the present disclosureare not limited thereto. The EPDCCH set in the present disclosure is agroup of physical resources that are configured by an eNB for a specificUE and that support EPDCCH transmission. The cell identity in thepresent disclosure includes a physical cell identity or a virtual cellidentity, where a physical cell identity is obtained by a UE from asynchronization channel, and a virtual cell identity is obtained by a UEfrom RRC information that is configured by an eNB. The search space inthe present disclosure includes a UE-specific search space or a commonsearch space.

FIG. 1 is a schematic flowchart of a method for determining a searchspace according to an embodiment of the present disclosure. The methodin FIG. 1 may be executed by a base station or a UE.

101. Determine numbers of at least two EPDCCH sets used for EPDCCHtransmission.

More than two groups of time frequency resources are allocated toEPDCCHs in a user level search space, where one group of time frequencyresources is referred to as an EPDCCH set. Each EPDCCH set correspondsto one EPDCCH set number, and the EPDCCH set number corresponding toeach EPDCCH set is different. For example, a number of an EPDCCH set isc, and c is a non-negative integer that is less than N, where N is thenumber of EPDCCH sets that are configured for a search space of a UE. Itshould be understood that, the number is not limited to a numeral butmay be any symbols, characters, information and the like that can beused for identification.

102. Determine, according to the numbers of the EPDCCH sets, locationoffsets of search spaces corresponding to the EPDCCH sets.

Different EPDCCH sets are made to correspond to different locationoffsets according to the numbers and other identification information.

103. Determine, according to the location offset of the search spacecorresponding to the EPDCCH set, the search space corresponding to theEPDCCH set.

Based on the foregoing technical solution, by grouping and numberingtime frequency resources of EPDCCHs, and determining different locationoffsets for different EPDCCH search spaces according to numbers, theembodiment of the present disclosure can reduce a probability of controlchannel search space conflict.

Optionally, in an embodiment, in step 102, a location offset of a searchspace corresponding to a first EPDCCH set may be determined according toa number of the first EPDCCH set, or a location offset of a search spacecorresponding to a second EPDCCH set may be determined according to anumber of the second EPDCCH set, or the location offset of the searchspace corresponding to the second EPDCCH set may be determined accordingto the number of the first EPDCCH set, or location offsets of searchspaces corresponding to the two EPDCCH sets may be determined at thesame time according to the numbers of the two EPDCCH sets.

Y_(k) ^((c)) is the location offset of the search space corresponding tothe EPDCCH set, and Y_(k) ^((c)) may be obtained according to thefollowing formula:

Y _(k) ^((c))=(A·Y _(k−1) ^((c))) mod D

where Y⁻¹=n_(RNTI)≠0, A=39827, D=65537, k=└n_(s)/2┘, └ ┘ is a round-downoperation, n_(RNTI) is a UE identifier, and n_(s) is a timeslot number.

According to the foregoing formula, the location offset of the searchspace corresponding to the first EPDCCH set may be determined, anintermediate variable is determined, and the location offset of thesearch space corresponding to the second EPDCCH set may be determined byusing the intermediate variable and the location offset of the searchspace corresponding to the first EPDCCH set.

Alternatively, according to the foregoing formula, the location offsetsof the search spaces corresponding to the two EPDCCH sets are determinedat the same time by changing a constant in the foregoing formula orassigning a new variable to the foregoing formula.

Optionally, in an embodiment, in step 103, the search spacecorresponding to the EPDCCH set may be determined according to thefollowing formula:

L{(Y_(k)+m′) mod └N_(eCCE,k)/L┘}+i

where L is an aggregation level (Aggregation Level); Y_(k) is a locationoffset of a search space, which is also referred to as a start locationof a search space; for a common search space, m′=m, and for auser-specific search space, if a user configures a carrier indicatorfield, m′=m+M^((L))·n_(CI), where n_(CI) is a value of the carrierindicator field, and if the user does not configure the carrierindicator field, m′=m, where m=0, . . . , M^((L))−1 and M^((L)) is thenumber of EPDCCHs; N_(eCCE,k) is the total number of eCCEs in a controlarea of a subframe k; mod is a modulo operation; and i=0, . . . , L−1.

The search space corresponding to the first EPDCCH set may be determinedaccording to the location offset of the search space corresponding tothe first EPDCCH set, and the search space corresponding to the secondEPDCCH set may further be determined according to the location offset ofthe search space corresponding to the second EPDCCH set. The foregoingtwo steps may be performed separately, or performed at the same timewithout order limited. Alternatively, an intermediate variable may bedetermined, and the location offset of the search space corresponding tothe second EPDCCH set is directly determined according to theintermediate variable and the location offset of the search spacecorresponding to the first EPDCCH set.

Therefore, by grouping and numbering time frequency resources ofEPDCCHs, and determining different location offsets for different EPDCCHsearch spaces according to numbers, the method for determining a controlchannel search space provided by the present disclosure can effectivelyreduce a probability of control channel search space conflict. Thereby,time frequency resources of control channels can be maximized in a caseof multiple users, and communication efficiency can be improved.

FIG. 2 is a schematic flowchart of a method for determining a searchspace according to still another embodiment of the present disclosure.The method in FIG. 2 may be executed by a base station or a UE. FIG. 2is a more specific embodiment of FIG. 1, and gives a specific method fordetermining a location offset of an EPDCCH set, and a specific methodfor determining a search space according to a location offset.

201. Determine a first number of a first EPDCCH set and a second numberof a second EPDCCH set, where the first EPDCCH set and the second EPDCCHset are used for EPDCCH transmission.

More than two groups of time frequency resources are allocated toEPDCCHs in a user level search space, where one group of time frequencyresources is referred to as an EPDCCH set. Each EPDCCH set correspondsto one EPDCCH set number, and the EPDCCH set number corresponding toeach EPDCCH set is different. For example, a number of an EPDCCH set isc, and c is a non-negative integer that is less than N, where N is thenumber of EPDCCH sets that are configured for a search space of a UE. Itshould be understood that, the number is not limited to a numeral butmay be any symbols, characters, information and the like that can beused for identification. Two EPDCCH sets are used as an example in thisembodiment, where a number of the first EPDCCH set is 0, and a number ofthe second EPDCCH set is 1.

202. Determine, according to the first number, a first location offsetof a search space corresponding to the first EPDCCH set.

The first location offset Y_(k) ⁽⁰⁾ may be obtained according to thefollowing formula:

Y _(k) ⁽⁰⁾=(A·Y _(k−1) ⁽⁰⁾) mod D

where Y⁻¹ ⁽⁰⁾=n_(RNTI)≠0, A=39827, D=65537, k=└n_(s)/2┘, n_(RNTI) is aUE identifier, and n_(s) is a timeslot number.

203. Determine a first offset parameter.

Set the first offset parameter be v, where v may be determined accordingto any one of the following methods: v is a fixed value; or the firstoffset parameter is determined according to a cell identity; or thefirst offset parameter is determined according to a UE identifier.

When the first offset parameter is a fixed value, a predefined value maybe assigned to v, where the predefined value is an integer that isgreater than 0 and less than 65538. The fixed value may be selectedrandomly or specified from the range. For example, the fixed value is39827.

That the first offset parameter is determined according to a cellidentity is a Cell-specific (Cell-specific) manner, where theCell-specific manner includes at least one of the following manners:

-   -   v is determined by a cell ID (a physical cell ID or a virtual        cell ID), for example, v=Cell_id or v=Cell_id mod B, where        Cell_id is a cell ID and B is a predefined positive integer that        is greater than 1 and less than 65537;    -   v is determined by a cell ID (a physical cell ID or a virtual        cell ID) and the number of eCCEs in an EPDCCH set, for example,        v=Cell_id mod N_(eCCE), where Cell_id is a cell ID, and N_(eCCE)        is the number of eCCEs in the second EPDCCH set, where an eCCE        is an enhanced control channel unit, and the number of eCCEs is        determined by time frequency resources allocated to the EPDCCH        set and an EPDCCH aggregation level;    -   v is determined by a cell ID (a physical cell ID or a virtual        cell ID) and the number of physical resource block pairs in an        EPDCCH set, for example, v=Cell_id mod N_(PRB), where N_(FRB),        is the number of physical resource block pairs in the second        EPDCCH set;    -   v is determined by a cell ID (a physical cell ID or a virtual        cell ID) and the number of eCCEs in one physical resource block        pair, for example, v=Cell_id mod M_(eCCE), where M_(eCCE) is the        number of eCCEs in one physical resource block pair;    -   v is determined by a cell ID (a physical cell ID or a virtual        cell ID) and an EPDCCH transmission mode, where, specifically,        when EPDCCHs are transmitted in a localized transmission mode, v        is determined by the cell ID and B₀, for example, v=Cell_id mod        B₀, and when EPDCCHs are transmitted in a distributed        transmission mode, v is determined by the cell ID and B₁, for        example, v=Cell_id mod B₁, where B₀ and B₁ are any predefined        values of positive integers from 1 to 65537; and    -   v is determined by a cell ID (a physical cell ID or a virtual        cell ID) and an EPDCCH aggregation level (that is, the number of        eCCEs included in one EPDCCH), for example, v=Cell_id mod L⁽¹⁾,        where L⁽¹⁾ is an aggregation level corresponding to an EPDCCH in        the second EPDCCH set.

That the first offset parameter is determined according to a UEidentifier is a UE-specific (UE-specific) manner, where the UE-specificmanner includes at least one of the following manners:

-   -   v is determined by a UE RNTI, for example, v=G·n_(RNTI) or        v=n_(RNTI) mod B₁, where n_(RNTI) is a UE RNTI, and G and B are        positive integers that are greater than 1 and less than 65536;    -   v is determined by a UE RNTI and a subframe number, for example,        v=k·n_(RNTI) or v=n_(RNTI) mod B, where n_(RNTI) is a UE RNTI, k        is a subframe number, and B is a positive integer that is        greater than 1 and less than 65536;    -   v is determined by a UE RNTI and the number of eCCEs in an        EPDCCH set, for example, v=n_(RNTI) mod N_(eCCE) where N_(eCCE)        is the number of eCCEs in the second EPDCCH set;    -   v is determined by a UE RNTI and the number of physical resource        block pairs in a EPDCCH set, for example, v=n_(RNTI) mod        N_(PRB), where N_(PRB) is the number of physical resource block        pairs in the second EPDCCH set;    -   v is determined by a UE RNTI and the number of eCCEs in one        physical resource block pair, for example, v=n_(RNTI) mod        M_(eCCE), where M_(eCCE) is the number of eCCEs in one physical        resource block pair;    -   v is determined by a UE RNTI and an EPDCCH transmission mode,        where, specifically, when EPDCCHs are transmitted in a localized        transmission mode, v is determined by the UE RNTI and B₀, for        example: v=n_(RNTI) mod B₀; and when EPDCCHs are transmitted in        a distributed transmission mode, v is determined by the UE RNTI        and B₁, for example, v=n_(RNTI) mod B₁, where B₀ and B₁ are any        predefined values of positive integers from 1 to 65537;    -   v is determined by a UE RNTI and an EPDCCH aggregation level        (that is, the number of eCCEs included in one EPDCCH), for        example v=n_(RNTI) mod L⁽¹⁾, where L⁽¹⁾ is an aggregation level        corresponding to an EPDCCH in the second EPDCCH set;    -   v is determined by the number of eCCEs in an EPDCCH set, for        example, v=A mod N_(eCCE), where A is a prime number and        N_(eCCE), is the number of eCCEs in the second EPDCCH set, where        an eCCE is an enhanced control channel element, and the number        of eCCEs is determined by time frequency resources allocated to        the EPDCCH set and an EPDCCH aggregation level;    -   v is determined by the number of physical resource block pairs        in an EPDCCH set, for example, v=A mod N_(PRB), where A is a        prime number, and N_(PRB) is the number of physical resource        block pairs in the second EPDCCH set;    -   v is determined by the number of eCCEs in one physical resource        block pair, for example, v=A mod M_(eCCE), where A is a prime        number, and M_(eCCE) is the number of eCCEs in one physical        resource block pair;    -   v is determined by an EPDCCH transmission mode, where,        specifically, when EPDCCHs are transmitted in a localized        transmission mode, v is determined by A and B₀, for example, v=A        mod B₀; and when EPDCCHs are transmitted in a distributed        transmission mode, v is determined by A and B₁, for example, v=A        mod B₁, where A is a prime number, and B₀ and B₁ are any        predefined values of positive integers from 1 to 65537; and    -   v is determined by an EPDCCH aggregation level (that is, the        number of eCCEs included in one EPDCCH), for example v=A mod        L⁽¹⁾, where A is a prime number, and L⁽¹⁾ is an aggregation        level corresponding to an EPDCCH in the second EPDCCH set.

204. Determine a second location offset according to the first offsetparameter and the first location offset.

The second location offset may be determined according to any one of thefollowing manners:

-   -   v is used as a relative offset value of two EPDCCH sets, for        example, Y_(k) ⁽¹⁾=Y_(k) ⁽⁰⁾+v, where Y_(k) ⁽⁰⁾ is a first        location offset of the k^(th) subframe, Y_(k) ⁽¹⁾ is a second        location offset of the k^(th) subframe, and v is a first offset        parameter; or    -   v is used as a relative offset parameter of two EPDCCH sets, and        the second location offset is defined by using a modulo        operation, for example, Y_(k) ⁽¹⁾=(Y_(k) ⁽⁰⁾+v) mod D or Y_(k)        ⁽¹⁾=(Y_(k) ⁽⁰⁾+v)mod(D−1) or Y_(k) ⁽¹⁾=(Y_(k) ⁽⁰⁾+v)mod(D−1)+1,        where Y_(k) ⁽⁰⁾ is a first location offset of the k^(th)        subframe, Y_(k) ⁽¹⁾ is a second location offset of the k^(th)        subframe, v is a first offset parameter, and D is an integer        that is greater than 0 and less than 65538; or    -   v is used as a relative offset parameter of two EPDCCH sets, and        the second location offset is determined according to the number        of eCCEs in an EPDCCH set, for example, Y_(k) ⁽¹⁾=(Y_(k)        ⁽⁰⁾+v)mod N_(eCCE), where Y_(k) ⁽⁰⁾ is a first location offset        of the k^(th) subframe, Y_(k) ⁽¹⁾ is a second location offset of        the k^(th) subframe, v is a first offset parameter, and N_(eCCE)        is the number of eCCEs in the second EPDCCH set; or    -   v is used as a relative offset parameter of two EPDCCH sets, and        the second location offset is determined according to the number        of physical resource block pairs in an EPDCCH set, for example,        Y_(k) ⁽¹⁾=(Y_(k) ⁽⁰⁾+v)mod N_(PRB), where Y_(k) ⁽⁰⁾ is a first        location offset of the k^(th) subframe, Y_(k) ⁽¹⁾ is a second        location offset of the k^(th) subframe, v is a first offset        parameter, and N_(PRB) is the number of physical resource block        pairs in the second EPDCCH set; or    -   v is used as a relative offset parameter of two EPDCCH sets, and        the second location offset is determined according to the number        of eCCEs in one physical resource block pair, for example, Y_(k)        ⁽¹⁾=(Y_(k) ⁽⁰⁾+v)mod M_(eCCE), where Y_(k) ⁽⁰⁾ is a first        location offset of the k^(th) subframe, Y_(k) ⁽¹⁾ is a second        location offset of the k^(th) subframe, v is a first offset        parameter, and M_(eCCE) is the number of eCCEs in one physical        resource block pair; or    -   a second location offset of the k^(th) subframe is determined        according a first location offset of the (k−1)^(th) subframe,        for example, Y_(k) ⁽¹⁾=(A·Y_(k−1) ⁽⁰⁾+v) mod D, where Y⁻¹        ⁽⁰⁾=n_(RNTI)≠0, A=39827, D=65537, k=└n_(s)/2┘, n_(RNTI) is a UE        identifier, and n_(s) is a timeslot number.

205. Determine, according to the first location offset, the search spacecorresponding to the first EPDCCH set, and determine, according to thesecond location offset, a search space corresponding to the secondEPDCCH set.

The search space corresponding to the first EPDCCH set is determinedaccording to the first location offset:

S_(k,0) ^((L)):L{(Y_(k) ⁽⁰⁾+m′) mod └N_(eCCE,k)/L┘}+i

where L is an aggregation level (Aggregation Level); Y_(k) ⁽⁰⁾ is thefirst location offset; for a common search space, m′=m, and for auser-specific search space, if a user configures a carrier indicatorfield, m′=m+M^((L)·n) _(CI), where n_(CI) is a value of the carrierindicator field, and if the user does not configure the carrierindicator field, m′=m, where m=0, . . . , M^((L))−1 and M^((L)) is thenumber of EPDCCHs; N_(eCCE,k) is the total number of eCCEs in a controlarea of a subframe k; and i=0, . . . , L−1.

The search space corresponding to the second EPDCCH set is determinedaccording to the second location offset:

S_(k,1) ^((L)):L{(Y_(k) ⁽¹⁾+m′) mod └N_(eCCE,k)/L┘}+i

where L is an aggregation level (Aggregation Level); Y_(k) ⁽¹⁾ is thesecond location offset; for a common search space; m′=m, and for auser-specific search space, if a user configures a carrier indicatorfield, m′=m+M^((L))·n_(CI), where n_(CI) is a value of the carrierindicator field, and if the user does not configure the carrierindicator field, m′=m, where m=0, . . . , M^((L))−1 and M^((L)) is thenumber of EPDCCHs; N_(eCCE,k) is the total number of eCCEs in a controlarea of a subframe k; and i=0, . . . , L−1.

Therefore, by grouping and numbering time frequency resources ofEPDCCHs, and determining different location offsets for different EPDCCHsearch spaces according to the numbers, different cell identities or UEidentifiers, and different EPDCCH resource allocation modes andtransmission modes, the method for determining a control channel searchspace provided by the present disclosure can effectively reduce aprobability of control channel search space conflict. Thereby, timefrequency resources of control channels can be maximized in a case ofmultiple users, and communication efficiency can be improved.

FIG. 3 is a schematic flowchart of a method for determining a searchspace according to still another embodiment of the present disclosure.The method in FIG. 3 may be executed by a base station or a UE. FIG. 3is another specific embodiment of FIG. 1, and a difference between FIG.3 and FIG. 2 lies in the method of determining a search space, where, inFIG. 3, after a first location offset is determined, a second searchspace is directly determined according to the first location offset anda first offset parameter.

301. Determine, according to a first number, a first location offset ofa search space corresponding to a first EPDCCH set.

This step is one circumstance of the foregoing step 201, that is, thefirst location offset of the search space corresponding to the firstEPDCCH set is determined independently. A specific determining methodhas been described in step 201, and details are not described again.

302. Determine a first offset parameter.

For a specific determining method, refer to step 202, and details arenot described again.

303. Determine, according to the first location offset, the search spacecorresponding to the first EPDCCH set, and determine a search spacecorresponding to a second EPDCCH set according to the first locationoffset and the first offset parameter.

The search space of the second EPDCCH set is directly determinedaccording to the first location offset and the first offset parameter,so that a process of determining a second location offset parameter isskipped.

The search space of the first EPDCCH set is determined: S_(k,0)^((L)):L{(Y_(k) ⁽⁰⁾+m′) mod └N_(eCCE,k)/L┘}+i, and the search space ofthe second EPDCCH set is determined: S_(k,1) ^((L)):L {(Y_(k) ⁽¹⁾+m′)mod └N_(eCCE,k)/L┘}+i, where L is an aggregation level (AggregationLevel); Y_(k) ⁽⁰⁾ is the first location offset; v is the first offsetparameter; for a common search space; m′=m, and for a user-specificsearch space, if a user configures a carrier indicator field,m′=m+M^((L))·n_(CI), where n_(CI) is a value of the carrier indicatorfield, and if the user does not configure the carrier indicator field,m′=m, where m=0, . . . , M^((L))−1 and M^((L)) is the number of EPDCCHs;N_(eCCE,k) is the total number of eCCEs in a control area of a subframek; and i=0, . . . , L−1.

Therefore, by grouping and numbering time frequency resources ofEPDCCHs, and determining different location offsets for different EPDCCHsearch spaces according to the numbers, different cell identities or UEidentifiers, and different EPDCCH resource allocation modes andtransmission modes, the method for determining a control channel searchspace provided by the present disclosure can effectively reduce aprobability of control channel search space conflict. Thereby, timefrequency resources of control channels can be maximized in a case ofmultiple users, and communication efficiency can be improved.

FIG. 4 is a schematic flowchart of a method for determining a searchspace according to still another embodiment of the present disclosure.The method in FIG. 4 may be executed by a base station or a UE. FIG. 4is a more specific embodiment of FIG. 1, where location offsets ofEPDCCH sets are determined at the same time by determining anintermediate parameter.

401. Determine a first parameter or a second parameter according to anumber of an EPDCCH set.

A value of the first parameter A^((c)) may be determined according toany one of the following manners:

-   -   the value of A^((c)) is determined in a predefining manner, for        example, A⁽⁰⁾=39827 and A⁽¹⁾=39829, where the value of A^((c))        is any one prime number that is greater than 1 and less than        65537, and includes but is not limited to any one of the        following values: 39671, 39679, 39703, 39709, 39719, 39727,        39733, 39749, 39761, 39769, 39779, 39791, 39799, 39821, 39827,        39829, 39839, 39841, 39847,39857, 39863, 39869, 39877, 39883,        39887, 39901, 39929, 39937, 39953, 39971, 39979, 39983, and        39989;    -   at least one A^((c)) value is determined according to a cell ID,        for example A⁽⁰⁾=39827, where when the cell ID is an odd number,        A⁽¹⁾=39827, and when the cell ID is an even number, A⁽¹⁾=39829,        or the other way round;    -   the value of A^((c)) is configured for a UE by using UE-specific        higher layer signaling, for example, for UE 1, A⁽⁰⁾=39827 and        A⁽¹⁾=39829, and for UE 2, A⁽⁰⁾=39839 and A⁽¹⁾=39841, where the        value of A^((c)) is any one prime number that is greater than 1        and less than 65537, and includes but is not limited to any one        of the following values: 39671, 39679, 39703, 39709, 39719,        39727, 39733, 39749, 39761, 39769, 39779, 39791, 39799, 39821,        39827, 39829, 39839, 39841, 39847,39857, 39863, 39869, 39877,        39883, 39887, 39901, 39929, 39937, 39953, 39971, 39979, 39983,        and 39989; and    -   at least one A^((c)) value is determined according to a UE RNTI,        for example A⁽⁰⁾=39827, where when the UE RNTI is an odd number,        A⁽¹⁾=39827, and when the UE RNTI is an even number, A⁽¹⁾=39829,        or the other way round.

A value of the second parameter D^((c)) may be determined according toany one of the following manners:

-   -   the value of D^((c)) is determined in a predefining manner, for        example, D⁽⁰⁾=65269 and D⁽¹⁾=65287, where the value of D^((c))        is any one prime number that is greater than 1 and less than        2³², and includes but is not limited to any one of the following        values: 65269, 65287, 65293, 65309, 65323, 65327, 65353, 65357,        65371, 65381, 65393, 65407, 65413, 65419, 65423, 65437, 65447,        65449, 65479, 65497, 65519, 65521, 65537, 65539, 65543, 65551,        65557, 65563, 65579, 65581, 65587, 65599, 65609, 65617, 65629,        65633, 65647, 65651, 65657, 65677, 65687, 65699, 65701, 65707,        65713, 65717, 65719, 65729, 65731, and 65761; and    -   further, D^((c)) is UE-specific or Cell-specific, or the like,        which has a same determining manner as the foregoing A^((c)),        with only a different value range, where, for the value range,        refer to the value range in the predefining manner of D^((c)),        and details are not described again.

402. Determine, according to the first parameter or the secondparameter, a location offset of a search space corresponding to theEPDCCH set.

The location offset of the search space corresponding to the EPDCCH setis determined according to any one of the following equations:

Y _(k) ^((c))=(A ^((c)) ·Y _(k−1) ^((c))) mod 65537 or Y _(k)^((c))=(39827·Y _(k−1) ^((c))) mod D ^((c))

-   -   where c is the number of the EPDCCH set, Y_(k) ^((c)) is a        location offset of a search space corresponding to the EPDCCH        set whose number is c in the k^(th) subframe, Y⁻¹=n_(RNTI)≠0,        k=└n_(s)/2┘, n_(RNTI) is a UE identifier, and n_(s) is a        timeslot number.

403. Determine, according to a first location offset, a search spacecorresponding to a first EPDCCH set, and determine, according to asecond location offset, a search space corresponding to a second EPDCCHset.

For a determining method, refer to step 205, and details are notdescribed again.

Therefore, by grouping and numbering time frequency resources ofEPDCCHs, and determining different location offsets for different EPDCCHsearch spaces according to the numbers and different cell identities orUE identifiers, the method for determining a control channel searchspace provided by the present disclosure can effectively reduce aprobability of control channel search space conflict. Thereby, timefrequency resources of control channels can be maximized in a case ofmultiple users, and communication efficiency can be improved.

FIG. 5 is a schematic flowchart of a method for determining a searchspace according to still another embodiment of the present disclosure.The method in FIG. 5 may be executed by a base station or a UE. FIG. 5is a more specific embodiment of FIG. 1, where location offsets ofEPDCCH sets are determined at the same time by determining anintermediate parameter, and a using method of the intermediate parameteris different from that in FIG. 4.

501. Determine a second offset parameter according to a number of anEPDCCH set.

A value of the second offset parameter r^((c)) may be determinedaccording to any one of the following manners:

-   -   the value of r^((c)) is determined in a predefining manner, for        example, r⁽⁰⁾=39827 and r⁽¹⁾=39829, where the value of r^((c))        is any integer that is greater than 1 and less than 65537;    -   at least one r^((c)) value is determined according to a cell ID,        for example r⁽⁰⁾=39827, where, when the cell ID is an odd        number, r⁽¹⁾=39827; and when the cell ID is an even number,        r⁽¹⁾=39829, or the other way round;    -   the value of A^((c)) is configured for a UE by using UE-specific        higher layer signaling, for example, for UE 1, A⁽⁰⁾=39827 and        A⁽¹⁾=39829, and for UE 2, A⁽⁰⁾=39839 and A⁽¹⁾=39841, where the        value of A^((c)) is any integer that is greater than 1 and less        than 65537; and    -   at least one r^((c)) value is determined according to a UE RNTI,        for example r⁽⁰⁾=39827, where, when the cell ID is an odd        number, r⁽¹⁾=39827; and when the cell ID is an even number,        r⁽¹⁾=39829, or the other way round.

502. Determine, according to the second offset parameter, a locationoffset of a search space corresponding to the EPDCCH set.

The location offset of the search space corresponding to the EPDCCH setis determined according to any one of the following equations:

Y _(k) ^((c))=(r ^((c)) ·A·Y _(k−1) ^((c))) mod D or Y _(k) ^((c))=(A·Y_(k−1) ^((c)) +r ^((c))) mod D

-   -   where c is the number of the EPDCCH set, Y_(k) ^((c)) is a        location offset of a search space corresponding to the EPDCCH        set whose number is c in the k^(th) subframe, Y⁻¹=n_(RNTI)≠0,        k=└n_(s)/2┘, n_(RNTI) is a UE identifier, n_(s) is a timeslot        number, A=39827, D=65537, and r^((c)) is the second offset        parameter.

503. Determine, according to a first location offset, a search spacecorresponding to a first EPDCCH set, and determine, according to asecond location offset, a search space corresponding to a second EPDCCHset.

For a determining method, refer to step 205, and details are notdescribed again.

Therefore, by grouping and numbering time frequency resources ofEPDCCHs, and determining different location offsets for different EPDCCHsearch spaces according to the numbers and different cell identities orUE identifiers, the method for determining a control channel searchspace provided by the present disclosure can effectively reduce aprobability of control channel search space conflict. Thereby, timefrequency resources of control channels can be maximized in a case ofmultiple users, and communication efficiency can be improved.

FIG. 6 is a schematic flowchart of a method for determining a searchspace according to still another embodiment of the present disclosure.The method in FIG. 6 may be executed by a base station or a UE. FIG. 6is a more specific embodiment of FIG. 1.

601. Determine numbers of EPDCCH sets used for enhanced physicaldownlink control channel EPDCCH transmission.

For a determining method, refer to step 101, and details are notdescribed again.

602. Determine a location offset of a search space corresponding to anEPDCCH set according to information in downlink control information, ora physical random access channel preamble identifier, or information inrandom access response grant, or information in a message 3.

In this embodiment, for a common search space, a location offset of thecommon search space is determined by using any explicit or implicitmessage of a message 0 or message 1 or message 2 or message 3 during aphysical random access channel PRACH process. Specifically, the locationoffset may be determined according to the following several manners:

-   -   by using the message 0, that is, DCI format 1A, any bit in the        DCI format 1A may be used to indicate a location offset of a UE        in the common search space;    -   by using the message 1, that is, a random access preamble index        (PRACH preamble index), which location offset is used is        determined; for example, an odd number corresponds to one        location offset of the search space, and an even number        corresponds to another location offset of the search space;    -   by using the message 2, that is, random access response grant        (Random Access Response Grant), a location offset of the common        search space of a UE is determined by adding a location offset        indicator bit of the common search space;    -   by using the message 3, that is, after the message 2, a location        offset indicator request bit of the common search space is added        to information sent by a UE to an eNB, so as to determine a        location offset of the common search space of the UE; and    -   by using a radio network temporary identifier RNTI of a UE, a        location offset of the UE in the common search space is        determined, for example, an odd RNTI corresponds to one location        offset of the search space, and an even RNTI corresponds to        another location offset of the search space, where the RNTI        includes but is not limited to a cell radio network temporary        identifier (C-RNTI), a random access radio network temporary        identifier (RA-RNTI), and a temporary cell radio network        temporary identifier (Temporary C-RNTI).

603. Determine, according to the location offset of the search spacecorresponding to the EPDCCH set, the search space corresponding to theEPDCCH set.

For a determining method, refer to step 205, and details are notdescribed again.

Therefore, by grouping and numbering time frequency resources ofEPDCCHs, and determining different location offsets for different EPDCCHsearch spaces according to the numbers, different cell identities or UEidentifiers, and different EPDCCH resource allocation modes andtransmission modes, the method for determining a control channel searchspace provided by the present disclosure can effectively reduce aprobability of control channel search space conflict. Thereby, timefrequency resources of control channels can be maximized in a case ofmultiple users, and communication efficiency can be improved.

FIG. 7 is a schematic block diagram of an apparatus for determining asearch space according to an embodiment of the present disclosure. Asshown in FIG. 7, this embodiment provides an apparatus 700, which canspecifically execute the steps in the foregoing embodiment in FIG. 1,and details are not described herein again. The apparatus 700 providedby this embodiment may specifically include a number determining unit701, an offset determining unit 702, and a search space determining unit703.

The number determining unit 701 is configured to determine numbers of atleast two EPDCCH sets used for enhanced physical downlink controlchannel EPDCCH transmission.

The offset determining unit 702 is configured to determine, according toa number of the EPDCCH set, a location offset of a search spacecorresponding to the EPDCCH set.

The search space determining unit 703 is configured to determine,according to the location offset of the search space corresponding tothe EPDCCH set, the search space corresponding to the EPDCCH set.

FIG. 8 is a schematic block diagram of an apparatus for determining asearch space according to another embodiment of the present disclosure.As shown in FIG. 8, this embodiment provides an apparatus 800, which canspecifically execute the steps in the foregoing embodiment in FIG. 2,and details are not described herein again. The apparatus 800 providedby this embodiment may specifically include a number determining unit701, an offset determining unit 802, and a search space determining unit803.

The offset determining unit 802 includes a first offset determiningsubunit 812, configured to determine, according to the first number, afirst location offset of a search space corresponding to the firstEPDCCH set; and a second offset determining subunit 832, configured todetermine, according to the second number, a second location offset of asearch space corresponding to the second EPDCCH set; and a first offsetparameter determining unit 822, configured to determine a first offsetparameter, where a specific determining method has been described instep 203 in the foregoing embodiment in FIG. 2, and details are notdescribed herein again.

The first offset parameter determining unit 822 may include a subunitthat is in the second offset determining subunit 832 or independent ofthe second offset determining subunit 832.

The search space determining unit 803 is configured to determine,according to the first location offset, the search space correspondingto the first EPDCCH set, and determine, according to the second locationoffset, the search space corresponding to the second EPDCCH set.

FIG. 9 is a schematic block diagram of an apparatus for determining asearch space according to another embodiment of the present disclosure.As shown in FIG. 9, this embodiment provides an apparatus 900, which canspecifically execute the steps in the foregoing embodiment in FIG. 3,and details are not described herein again. The apparatus 900 providedby this embodiment may specifically include a number determining unit701, an offset determining unit 902, and a search space determining unit903, where:

-   -   the offset determining unit 902 includes a first offset        determining subunit 912, configured to determine, according to        the first number, a first location offset of a search space        corresponding to the first EPDCCH set; and    -   the search space determining unit 903 includes: a first offset        parameter determining unit 913 and a search space determining        subunit 923.

The first offset parameter determining unit 913 is configured todetermine a first offset parameter, where a specific determining methodhas been described in step 203 in the foregoing embodiment in FIG. 2,and details are not described herein again. The search space determiningsubunit 923 is configured to determine, according to the first locationoffset and the first offset parameter, a search space corresponding to asecond EPDCCH set.

FIG. 10 is a schematic block diagram of an apparatus for determining asearch space according to another embodiment of the present disclosure.As shown in FIG. 10, this embodiment provides an apparatus 1000, whichcan specifically execute the steps in the foregoing embodiment in FIG. 3or FIG. 4, and details are not described herein again. The apparatus1000 provided by this embodiment may specifically include a numberdetermining unit 701, an offset determining unit 1002, and a searchspace determining unit 1003.

The offset determining unit 1002 includes a second offset parameterdetermining unit 1012, a first offset determining subunit 1022, and asecond offset determining subunit 1023.

The second offset parameter determining unit 1012 is configured todetermine a first parameter A^((c)) or a second parameter D^((c)) or asecond offset parameter r^((c)) according to a number of the EPDCCH set,where a specific determining method has been described in step 401 ofthe embodiment in FIG. 4 and step 501 of the embodiment in FIG. 5, anddetails are not described herein again.

The search space determining unit 1003 is configured to determine,according to the first location offset, a search space corresponding toa first EPDCCH set, and determine, according to the second locationoffset, a search space corresponding to a second EPDCCH set.

Therefore, by grouping and numbering time frequency resources ofEPDCCHs, and determining different location offsets for different EPDCCHsearch spaces according to the numbers, different cell identities or UEidentifiers, and different EPDCCH resource allocation modes andtransmission modes, the apparatus for determining a control channelsearch space provided by the present disclosure can effectively reduce aprobability of control channel search space conflict. Thereby, timefrequency resources of control channels can be maximized in a case ofmultiple users, and communication efficiency can be improved.

FIG. 11 is a schematic block diagram of an apparatus for determining asearch space according to another embodiment of the present disclosure.As shown in FIG. 11, this embodiment provides an apparatus 1100, whichcan specifically execute the steps of any one of the foregoingembodiments, and details are not described herein again. The apparatus1100 provided by this embodiment may specifically include a memory 1101and a processor 1102.

The memory 1101 may be configured to store numbers of EPDCCH sets usedfor enhanced physical downlink control channel EPDCCH transmission,determine, according to a number of the EPDCCH set, a location offset ofa search space corresponding to the EPDCCH set, and determine, accordingto the location offset of the search space corresponding to the EPDCCHset, code that is required by the search space corresponding to theEPDCCH set.

The memory 1101 may further be configured to store the numbers of EPDCCHsets, a first offset parameter, a second offset parameter, a firstparameter, a second parameter, a location offset of a search spacecorresponding to an EPDCCH set and the search space corresponding to theEPDCCH set, so that the processor stores to-be-processed data andto-be-output data and temporarily stores intermediate data.

The memory 1101 may either be a memory that is independent of theprocessor 1102, or be a cache that is included in the processor 1102.

The processor 1102 is configured to execute the code in the memory 1101,so as to determine a number of an EPDCCH set used for enhanced physicaldownlink control channel EPDCCH transmission, determine, according tothe number of the EPDCCH set, a location offset of a search spacecorresponding to the EPDCCH set, and determine, according to thelocation offset of the search space corresponding to the EPDCCH set, thesearch space corresponding to the EPDCCH set.

The processor 1102 may further be configured to determine a first offsetparameter, a second offset parameter, a first parameter, and a secondparameter. For a determining method of the first offset parameter, referto step 203 in the foregoing embodiment in FIG. 2; for a determiningmethod of the second offset parameter, refer to step 501 in theforegoing embodiment in FIG. 5; and for determining methods of the firstparameter and the second parameter, refer to step 401 in the foregoingembodiment in FIG. 4.

Therefore, by grouping and numbering time frequency resources ofEPDCCHs, and determining different location offsets for different EPDCCHsearch spaces according to the numbers, different cell identities or UEidentifiers, and different EPDCCH resource allocation modes andtransmission modes, the apparatus for determining a control channelsearch space provided by the present disclosure can effectively reduce aprobability of control channel search space conflict. Thereby, timefrequency resources of control channels can be maximized in a case ofmultiple users, and communication efficiency can be improved.

A person of ordinary skill in the art may be aware that, in combinationwith the examples described in the embodiments disclosed in thisspecification, units and algorithm steps may be implemented byelectronic hardware, computer software, or a combination thereof. Toclearly describe the interchangeability between the hardware and thesoftware, the foregoing has generally described compositions and stepsof each example according to functions. Whether the functions areperformed by hardware or software depends on particular applications anddesign constraint conditions of the technical solutions. A personskilled in the art may use different methods to implement the describedfunctions for each particular application, but it should not beconsidered that the implementation goes beyond the scope of the presentdisclosure.

It may be clearly understood by a person skilled in the art that, forthe purpose of convenient and brief description, for a detailed workingprocess of the foregoing system, apparatus, and unit, reference may bemade to a corresponding process in the foregoing method embodiments, anddetails are not described herein again.

In the several embodiments provided in the present application, itshould be understood that the disclosed system, apparatus, and methodmay be implemented in other manners. For example, the describedapparatus embodiment is merely exemplary. For example, the unit divisionis merely logical function division and may be other division in actualimplementation. For example, a plurality of units or components may becombined or integrated into another system, or some features may beignored or not performed. In addition, the displayed or discussed mutualcouplings or direct couplings or communication connections may beimplemented through some interfaces. The indirect couplings orcommunication connections between the apparatuses or units may beimplemented in electronic, mechanical, or other forms.

The units described as separate parts may or may not be physicallyseparate, and parts displayed as units may or may not be physical units,may be located in one position, or may be distributed on a plurality ofnetwork units. Some or all of the units may be selected according toactual needs to achieve the objectives of the solutions of theembodiments of the present disclosure.

In addition, functional units in the embodiments of the presentdisclosure may be integrated into one processing unit, or each of theunits may exist alone physically, or two or more units are integratedinto one unit. The integrated unit may be implemented in a form ofhardware, or may be implemented in a form of a software functional unit.

When the integrated unit is implemented in the form of a softwarefunctional unit and sold or used as an independent product, theintegrated unit may be stored in a computer-readable storage medium.Based on such an understanding, the technical solutions of the presentdisclosure essentially, or the part contributing to the prior art, orall or a part of the technical solutions may be implemented in the formof a software product. The software product is stored in a storagemedium and includes several instructions for instructing a computerdevice (which may be a personal computer, a server, or a network device)to perform all or a part of the steps of the methods described in theembodiments of the present disclosure. The foregoing storage mediumincludes: any medium that can store program code, such as a USB flashdrive, a removable hard disk, a read-only memory (ROM), a random accessmemory (RAM), a magnetic disk, or an optical disc.

The foregoing descriptions are merely specific embodiments of thepresent disclosure, but are not intended to limit the protection scopeof the present disclosure. Any modification or replacement readilyfigured out by a person skilled in the art within the technical scopedisclosed in the present disclosure shall fall within the protectionscope of the present disclosure. Therefore, the protection scope of thepresent disclosure shall be subject to the protection scope of theclaims.

What is claimed is:
 1. A method comprising: determining, according to anindex number c of a physical resource set, a parameter A^((c));determining, according to the parameter A^((c)), a search spaceassociated with the physical resource set, wherein the parameterA^((c))=39827 if the index number c is a first index number, theparameter A^((c))=39829 if the index number c is a second index number;and detecting, in the search space, downlink control information.
 2. Themethod according to claim 1, wherein the first index number is 0, andthe second index number is
 1. 3. The method according to claim 1,wherein the determining, according to the parameter A^((c)), the searchspace associated with the physical resource set comprises: determining,according to the parameter A^((c)), a parameter Y_(k) ^((c))corresponding to the physical resource set in time unit k; anddetermining, according to the parameter Y_(k) ^((c)), the search spaceassociated with the physical resource set; wherein the parameter Y_(k)^((c)) satisfies a following relationship:Y _(k) ^((c))=(A ^((c)) ·Y _(k−1) ^((c))) mod 65537 whereinY⁻¹=n_(RNTI)≠0, n_(RNTI) is an identifier of a terminal device, and thetime unit comprises 12 or 14 orthogonal frequency division multiplexing(OFDM) symbols.
 4. The method according to claim 3, wherein the timeunit k is subframe k.
 5. The method according to claim 3, wherein theparameter Y_(k) ^((c)) is a location offset of the search space.
 6. Themethod according to claim 1, wherein the parameter A^((c))=39839 if theindex number c is a third index number.
 7. An apparatus, comprising: atleast one processor; and a non-transitory computer-readable storagemedium coupled to the at least one processor and storing programminginstructions for execution by the at least one processor, wherein theprogramming instructions instruct the at least one processor to:determine, according to an index number c of a physical resource set, aparameter A^((c)); determine, according to the parameter A^((c)), asearch space associated with the physical resource set, wherein theparameter A^((c))=39827 if the index number c is a first index number,the parameter A^((c))=39829 if the index number c is a second indexnumber; and detect in the search space, downlink control information. 8.The apparatus according to claim 7, wherein the first index number is 0,and the second index number is
 1. 9. The apparatus according to claim 7,wherein the programming instructions instruct the at least one processorto: determine, according to the parameter A^((c)), a parameter Y_(k)^((c)) corresponding to the physical resource set in time unit k; anddetermine, according to the parameter Y_(k) ^((c)), the search spaceassociated with the physical resource set; wherein the parameter Y_(k)^((c)) satisfies a following relationship:Y _(k) ^((c))=(A ^((c)) ·Y _(k−1) ^((c))) mod 65537 whereinY⁻¹=n_(RNTI)≠0, n_(RNTI) is an identifier of the user equipment, and thetime unit k comprises 12 or 14 orthogonal frequency divisionmultiplexing (OFDM) symbols.
 10. The apparatus according to claim 9,wherein the time unit k is subframe k.
 11. The apparatus according toclaim 9, wherein the parameter Y_(k) ^((c)) is a location offset of thesearch space.
 12. The apparatus according to claim 7, wherein theparameter A^((c))=39839 if the index number c is a third index number.13. The apparatus according to claim 7, wherein the physical resourceset is one of at least two physical resource sets.
 14. A non-transitorycomputer-readable storage medium, storing programming instructions forexecution by at least one processor, wherein the programminginstructions instruct the at least one processor to: determine,according to an index number c of a physical resource set, a parameterA^((c)); determine, according to the parameter A^((c)), a search spaceassociated with the physical resource set, wherein the parameterA^((c))=39827 if the index number c is a first index number, theparameter A^((c))=39829 if the index number c is a second index number;and detect in the search space, downlink control information.
 15. Themedium according to claim 14, wherein the first index number is 0, andthe second index number is
 1. 16. The medium according to claim 14,wherein the programming instructions instruct the at least one processorto: determine, according to the parameter A^((c)), a parameter Y_(k)^((c)) corresponding to the physical resource set in time unit k; anddetermine, according to the parameter Y_(k) ^((c)), the search spaceassociated with the physical resource set; wherein the parameter Y_(k)^((c)) satisfies a following relationship:Y _(k) ^((c))=(A ^((c)) ·Y _(k−1) ^((c))) mod 65537 whereinY⁻¹=n_(RNTI)≠0, n_(RNTI) is an identifier of the user equipment, and thetime unit k comprises 12 or 14 orthogonal frequency divisionmultiplexing (OFDM) symbols.
 17. The medium according to claim 16,wherein the time unit k is subframe k.
 18. The medium according to claim16, wherein the parameter Y_(k) ^((c)) is a location offset of thesearch space.
 19. The medium according to claim 14, wherein theparameter A^((c))=39839 if the index number c is a third index number.20. The medium according to claim 14, wherein the physical resource setis one of at least two physical resource sets.